Skew-space garbage collection

Skew-space garbage collection

Semispace garbage collectors relocate all the live objects in one step, which is simple and leads to good performance. Compared with mark-compact collectors, however, they need to reserve extra heap space for copying live objects. As much as half of the heap could be reserved as it is possible that all the allocated objects survive. In reality, however, most programs exhibit a high infant morta...

Space E cient Conservative Garbage Collection

We call a garbage collector conservative if it has only partial information about the location of pointers and is thus forced to treat arbitrary bit patterns as though they might be pointers in at least some cases We show that some very inexpensive but previously unused tech niques can have dramatic impact on the e ectiveness of conservative garbage collectors in reclaiming mem ory Our most sig...

Immix Garbage Collection: Fast Collection, Space Efficiency, and Mutator Locality

No current garbage collector combines space efficiency, low collector times, and mutator (application) locality for contemporaneously allocated objects. For example, free-list allocation coupled with mark-sweep collection achieves space efficiency, but poor mutator locality. On the other hand, contiguous (bump-pointer) allocation with copying collection provides mutator locality but poor space ...

Depth-first Copying Garbage Collection without Extra Stack Space

In this paper, we propose two copying garbage collection methods. These two methods copy data structures in depthrst order, while conventional method copies in breadthrst order. This modi cation greatly improves memory access locality during both garbage collection and computation after. Restriction on data structure representation is also relaxed because the proposed methods don't require that...

On Bounding Time and Space for Multiprocessor Garbage Collection